Transversality and Alternating Projections for Nonconvex Sets
نویسندگان
چکیده
We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear convergence. When the two sets are semi-algebraic and bounded, but not necessarily transversal, we nonetheless prove subsequence convergence.
منابع مشابه
Alternating projections and coupling slope
We consider the method of alternating projections for finding a point in the intersection of two possibly nonconvex closed sets. We present a local linear convergence result that makes no regularity assumptions on either set (unlike previous results), while at the same time weakening standard transversal intersection assumptions. The proof grows out of a study of the slope of a natural nonsmoot...
متن کاملConvergence Analysis of Alternating Nonconvex Projections
We consider the convergence properties for alternating projection algorithm (a.k.a alternating projections) which has been widely utilized to solve many practical problems in machine learning, signal and image processing, communication and statistics since it is a gradient-free method (without requiring tuning the step size) and it usually converges fast for solving practical problems. Although...
متن کاملAlternating minimization and projection methods for structured nonconvex problems
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : R → R∪{+∞} and g : R → R∪{+∞} are proper lower semicontinuous functions, and Q : R × R → R is a smooth C function which couples the variables x and y. The algorithm can be viewed as a proximal regularization of the usual Gau...
متن کاملProximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz Inequality
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → R∪{+∞} and g : Rm → R∪{+∞} are proper lower semicontinuous functions, and Q : Rn × Rm → R is a smooth C function which couples the variables x and y. The algorithm can be viewed as a proximal regularization of the usual...
متن کاملS ep 2 00 7 Local convergence for alternating and averaged nonconvex projections
The idea of a finite collection of closed sets having " strongly regular intersection " at a given point is crucial in variational analysis. We show that this central theoretical tool also has striking algorithmic consequences. Specifically, we consider the case of two sets, one of which we assume to be suitably " regular " (special cases being convex sets, smooth manifolds, or feasible regions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Foundations of Computational Mathematics
دوره 15 شماره
صفحات -
تاریخ انتشار 2015